Using probabilistic argumentation for key validation in public-key cryptography
نویسندگان
چکیده
منابع مشابه
Using probabilistic argumentation for key validation in public-key cryptography
The purpose of this paper is to show how probabilistic argumentation is applicable to modern public-key cryptography as an appropriate tool to evaluate webs of trust. This is an interesting application of uncertain reasoning that has not yet received much attention in the corresponding literature.
متن کاملWeb of Trust: Applying Probabilistic Argumentation to Public-Key Cryptography
The purpose of this paper is to show how probabilistic argumentation is applicable to modern public-key cryptography as an appropriate tool to evaluate webs of trust. This is an interesting application of uncertain reasoning that has not yet received much attention in the corresponding literature.
متن کاملCryptography. key exchange, public key
General cryptographic schemes are presented where keys can be one-time or ephemeral. Processes for key exchange are derived. Public key cryptographic schemes based on the new systems are established. Authentication and signature schemes are easy to implement. The schemes may be integrated with error-correcting coding schemes so that encryption/coding and decryption/decoding may be done simultan...
متن کاملIdentity-Based Key Management in MANETs using Public Key Cryptography
Wireless mobile Ad Hoc Networks (MANETs) are an emerging area of mobile computing. MANETs face serious security problems due to their unique characteristics such as mobility, dynamic topology and lack of central infrastructure support. In conventional networks, deploying a robust and reliable security scheme such as Public Key Infrastructure (PKI) requires a central authority or trusted third p...
متن کاملUsing decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by now. Most of these problems are search problems, i.e., they are of the following nature: given a property P and the information that there are objects with the property P, find at least one particular object with the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2005
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2004.05.010